Hamiltonicity in randomly perturbed hypergraphs
نویسندگان
چکیده
منابع مشابه
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to a dense k-uniform hypergraph ensures the (asymptotically almost sure) existence of a perfect matching or a loose Hamilton cycle. The proof involves a nonstan...
متن کاملHamiltonicity and $\sigma$-hypergraphs
We define and study a special type of hypergraph. A σ-hypergraph H = H(n, r, q | σ), where σ is a partition of r, is an r-uniform hypergraph having nq vertices partitioned into n classes of q vertices each. If the classes are denoted by V1, V2,...,Vn, then a subset K of V (H) of size r is an edge if the partition of r formed by the non-zero cardinalities | K ∩ Vi |, 1 ≤ i ≤ n, is σ. The non-emp...
متن کاملRandomly colouring simple hypergraphs
We study the problem of constructing a (near) random proper q-colouring of a simple k-uniform hypergraph with n vertices and maximum degree ∆. (Proper in that no edge is mono-coloured and simple in that two edges have maximum intersection of size one). We give conditions on q,∆ so that if these conditions are satisfied, Glauber dynamics will converge in O(n log n) time from a random (improper) ...
متن کاملRandomly coloring simple hypergraphs
We study the problem of constructing a (near) uniform random proper q-coloring of a simple k-uniform hypergraph with n vertices and maximum degree ∆. (Proper in that no edge is mono-colored and simple in that two edges have maximum intersection of size one). We show that if for some α < 1 we have ∆ ≥ n and q ≥ ∆ then Glauber dynamics will become close to uniform in O(n log n) time from a random...
متن کاملOn Randomly Generated Intersecting Hypergraphs
An intersecting hypergraph is one in which each pair of edges has a nonempty intersection. Here, we consider r-uniform hypergraphs which are those for which all edges contain r vertices. ∗Supported in part by NSF grant DMS-0100400. †Supported in part by NSF grant CCR-9818411. ‡Supported in part by NSF VIGRE grant DMS-9819950. §Research was partially supported by OTKA Grants T 030059, T 029074, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2020
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2019.12.005